Analysis of Macro-Dataflow Dynamic Scheduling on Nonuniform Memory Access Architectures

Abstract: This paper studies dynamics scheduling of computational tasks with communication costs using Non-uniform memory access architecture that computing model assumes that the data transfer can be partitioned into a parallel in sequential parts with respect to the task execution as scheduling heuristic called least communication together with a two level scheduler as proposed in an attempt to minimize the finish time the LC selects the task that removes the largest amount of remaining data transfer, if no such tasks are available the task that has been ready to run at the earliest is selected first. Testing the finish time of LC and FCFS shows that LC is useful for tasks are having moderate granularity and whose computation and communication requirements vary widely for different data sets.